Code Optimization for Lossless Turbo Source Coding
نویسنده
چکیده
A novel source coding scheme based on turbo codes was presented in [1]. Lossless data compression is thereby achieved by puncturing data encoded with a turbo code while checking the integrity of the reconstructed information during compression. In this paper we apply code optimization tools to serially concatenated turbo source codes. The goal of the optimization is to minimize the area of the tunnel in the modified EXIT chart as it is proportional to the gap between source coding rate and entropy. We show that compression rates close to the Shannon limit can be obtained by irregular repeat accumulate codes.
منابع مشابه
Joint Source-Channel Turbo Techniques for Discrete-Valued Sources: From Theory to Practice
The principles which have been prevailing so far for designing communication systems rely on Shannon’s source and channel coding separation theorem [1]. This theorem states that source and channel optimum performance bounds can be approached as close as desired by designing independently the source and channel coding strategies. However, this theorem holds only under asymptotic conditions, wher...
متن کاملThe turbo-fountain
Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalisation for fountain codes operating on erasure channels, and we generalise the problem formalisation to more general channels. We introduce a novel type of rateless codes based on the Turbo Principle: the Turbo-Fountain. The Turbo-Fountain is able to consi...
متن کاملAn Efficient SF-ISF Approach for the Slepian-Wolf Source Coding Problem
A simple but powerful scheme exploiting the binning concept for asymmetric lossless distributed source coding is proposed. The novelty in the proposed scheme is the introduction of a syndrome former (SF) in the source encoder and an inverse syndrome former (ISF) in the source decoder to efficiently exploit an existing linear channel code without the need to modify the code structure or the deco...
متن کاملJoint Source-Channel-Fountain Coding for Asynchronous Broadcast
A novel concept of joint source-fountain coding for asynchronous wireless broadcast is presented. The traditional field of joint source-channel coding aims in both lossless data compression as well as reliable data delivery. Besides, fountain coding allows reliable broadcast without the need of feedback, and furthermore, asynchronous data access, i.e., each receiver is able to decide when it wa...
متن کاملLossless Turbo Source Coding with Decremental Redundancy
Recent results indicate that the same turbo principle which delivers near to optimal strategies for channel coding, can be used to obtain very efficient source coding schemes. We investigate this issue applying ten Brink’s EXIT chart analysis and show how this technique can be used to select the most efficient match of component codes and puncturing matrices to compress discrete memoryless sour...
متن کامل